/** Copyright (c) 2008-2009, Markos Evlogimenos
 *
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 *     * Redistributions of source code must retain the above copyright
 *       notice, this list of conditions and the following disclaimer.
 *     * Redistributions in binary form must reproduce the above copyright
 *       notice, this list of conditions and the following disclaimer in
 *       the documentation and/or other materials provided with the
 *       distribution.
 *     * The name of Markos Evlogimenos may be used to endorse or
 *		 promote products derived from this software without specific
 *		 prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */

package org.kamimark.java.util;

public class ArraysMath
{

	public static void add(final int[] array, final int addition) {
		for (int i = 0; i < array.length; i++)
			array[i] += addition;
	}

	public static boolean add(final int[] array, final int[] addition) {

		if (array.length != addition.length)
			return false;

		for (int i = 0; i < array.length; i++)
			array[i] += addition[i];
		return true;

	}

	/**
	 * @param fromArray
	 * @param toArray
	 *            Make sure fromArray.length == toArray.length
	 * @return int [] where fromArray[i]+int[i] = toArray[i]
	 */
	public static int[] getDifference(final int[] fromArray, final int[] toArray) {

		final int[] difference = new int[fromArray.length];

		for (int i = 0; i < difference.length; i++)
			difference[i] = toArray[i] - fromArray[i];

		return difference;
	}

	/**
	 * @param fromArray
	 * @param toArray
	 *            Make sure fromArray.length == toArray.length
	 * @return float [] where fromArray[i]/float[i] = toArray[i]
	 */
	public static float[] getMultiplier(final int[] fromArray, final int[] toArray) {

		final float[] analogy = new float[fromArray.length];

		for (int i = 0; i < analogy.length; i++) {
			analogy[i] = toArray[i];
			if (fromArray[i] != 0)
				analogy[i] /= fromArray[i];
		}

		return analogy;
	}

	public static void multiply(final int[] array, final float factor) {
		for (int i = 0; i < array.length; i++)
			array[i] *= factor;
	}

	public static boolean multiply(final int[] array, final float[] factor) {

		if (array.length != factor.length)
			return false;

		for (int i = 0; i < array.length; i++)
			array[i] *= factor[i];
		return true;

	}

	public static void multiply(final int[] array, final int factor) {
		for (int i = 0; i < array.length; i++)
			array[i] *= factor;
	}

	private ArraysMath() {
	}

}
